import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:二维前缀和
 * User: bjc
 * Date: 2025-11-18
 * Time: 19:03
 */
public class Test02_twoPrefixSum {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        //1.读入数据
        int n = in.nextInt(); //行数
        int m = in.nextInt(); //列数
        int q = in.nextInt(); //查询次数
        int[][] arr = new int[n + 1][m + 1];
        long[][] dp = new long[n + 1][m + 1]; //防止数据溢出
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                arr[i][j] = in.nextInt();
            }
        }
        //2.预处理前缀和矩阵
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                //表示从（1,1）到（i,j）所有元素的和
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + arr[i][j];
            }
        }
        //3.使用前缀和矩阵
        while (q != 0) {
            int x1 = in.nextInt();
            int y1 = in.nextInt();
            int x2 = in.nextInt();
            int y2 = in.nextInt();
            long ret = dp[x2][y2] - dp[x1 - 1][y2] - dp[x2][y1 - 1] + dp[x1 - 1][y1 - 1];
            System.out.println(ret);
            q--;
        }
    }
}
